package leetcode.problems;

import java.util.HashMap;
import java.util.Map;

/**
 * Find All Anagrams in a String
 * 查找字符串中的所有字母组合
 * Created by gmwang on 2018/3/23
 */
public class _0325TwoSum {
    /**
     * Given an array of integers, return indices of the two numbers such that they add up to a specific target.

         You may assume that each input would have exactly one solution, and you may not use the same element twice.

         Example:
         Given nums = [2, 7, 11, 15], target = 9,

         Because nums[0] + nums[1] = 2 + 7 = 9,
         return [0, 1].
        给定一组整数，将两个数的返回指数相加，使它们相加成一个特定的目标。
        可以假设每个输入都有一个解决方案，可能不会使用相同的元素两次。
         Example:
         Given nums = [2, 7, 11, 15], target = 9,

         Because nums[0] + nums[1] = 2 + 7 = 9,
        return [0, 1].
     */
    public static int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i =0;i< nums.length;i++){
            if (map.containsKey(target - nums[i])) {
                result[1] = i;
                result[0] = map.get(target - nums[i]);
                return result;
            }
            map.put(nums[i], i);
        }
        return result;
    }

    public static void main(String[] args) {
        int [] nums = {2, 7, 11, 15};
        int target = 9;
        int[] ints = twoSum(nums, target);
        for (int x= 0;x<ints.length;x++){
            System.out.println(ints[x]);
        }
    }

}
